ARating-RankingMethod for Crowdsourced Top-k Computation

Crowdsourced top-k computation aims to utilize the human ability to identify top-k objects from a given set of objects. Most of existing studies employ a pairwise comparison based method, which first asks workers to compare each pair of objects and then infers the top-k results based on the pairwise comparison results. Obviously, it is quadratic to compare every object pair and these methods involve hugemonetary cost, especially for large datasets. To address this problem, we propose a rating-ranking-based approach, which contains two types of questions to ask the crowd. The first is a rating question, which asks the crowd to give a score for an object. The second is a ranking question, which asks the crowd to rank several (e.g., 3) objects. Rating questions are coarse grained and can roughly get a score for each object, which can be used to prune the objects whose scores are much smaller than those of the topk objects. Ranking questions are fine grained and can be used to refine the scores. We propose a unified model to model the rating and ranking questions, and seamlessly combine them together to compute the top-k results. We also study how to judiciously select appropriate rating or ranking questions and assign them to a coming worker. Experimental results on real datasets show that our method significantly outperforms existing approaches. ACM Reference Format: Kaiyu Li, Xiaohang Zhang, Guoliang Li. 2018. A Rating-RankingMethod for Crowdsourced Top-k Computation. In Proceedings of 2018 International Conference on Management of Data (SIGMOD/PODS ’18). ACM, New York, NY, USA, 16 pages. https://doi.org/10.1145/3183713.3183762